A HIERARCHY OF REGULAR TRACE LANGUAGES AND SOME COMBINATORIAL APPLICATIONSBERTONI A; MAURI G; SABADINI N et al.1982; WORLD CONFERENCE ON MATHEMATICS AT THE SERVICE OF MAN. 2/1982-06-28/LAS PALMAS; ESP; DA. 1982; PP. 146-153; BIBL. 10 REF.Conference Paper

EQUIVALENCE AND MEMBERSHIP PROBLEMS FOR REGULAR TRACE LANGUAGESBERTONI A; MAURI G; SABADINI N et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 61-71; BIBL. 11 REF.Conference Paper

AN APPLICATION OF THE THEORY OF FREE PARTIALLY COMMUTATIVE MONOIDS: ASYMPTOTIC DENSITIES OF TRACE LANGUAGESBERTONI A; BRAMBILLA M; MAURI G et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 205-215; BIBL. 13 REF.Conference Paper

A note on the construction of marked graphsTHIRUSANGU, K; RANGARAJAN, K.Information processing letters. 1995, Vol 55, Num 4, pp 211-215, issn 0020-0190Article

A trace semantics for Petri netsHOOGERS, P. W; KLEIJN, H. C. M; THIAGARAJAN, P. S et al.Information and computation (Print). 1995, Vol 117, Num 1, pp 98-114, issn 0890-5401Article

Behavioural notions for elementary net systemsNIELSEN, M; ROZENBERG, G; THIAGARAJAN, P. S et al.Distributed computing. 1990, Vol 4, Num 1, pp 45-57, issn 0178-2770, 13 p.Article

Families of automata characterizing context-sensitive languagesMORVAN, Christophe; RISPAL, Chloé.Acta informatica. 2005, Vol 41, Num 4-5, pp 293-314, issn 0001-5903, 22 p.Article

Asynchronous mappings and asynchronous cellular automataCORI, R; METIVIER, Y; ZIELONKA, W et al.Information and computation (Print). 1993, Vol 106, Num 2, pp 159-202, issn 0890-5401Article

Mixed product and asynchronous automataDUBOC, C.Theoretical computer science. 1986, Vol 48, Num 2-3, pp 183-199, issn 0304-3975Article

Pure future local temporal logics are expressively complete for Mazurkiewicz tracesDIEKERT, Volker; GASTIN, Paul.Information and computation (Print). 2006, Vol 204, Num 11, pp 1597-1619, issn 0890-5401, 23 p.Article

Pomsets for local trace languages : Recognizability, logic & Petri netsKUSKE, D; MORIN, R.Lecture notes in computer science. 2000, pp 426-441, issn 0302-9743, isbn 3-540-67897-2Conference Paper

Complete subgraphs of bipartite graphs and applications to trace languagesGUAIANA, G; RESTIVO, A; SALEMI, S et al.Informatique théorique et applications (Imprimé). 1990, Vol 24, Num 4, pp 409-417, issn 0988-3754, 9 p.Article

Commutations dans les monoïdes libres : un cadre théorique pour l'étude du parallélisme = Commutations in free monoids: a theoretic approach for the study of parallelismDUBOC, Christine; CHOFFRUT, Christian.1986, 170 fThesis

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automataNAGY, Benedek; OTTO, Friedrich.Acta informatica. 2013, Vol 50, Num 4, pp 229-255, issn 0001-5903, 27 p.Article

Membership problems for regular and context-free trace languagesBERTONI, A; MAURI, G; SABADINI, N et al.Information and computation (Print). 1989, Vol 82, Num 2, pp 135-150, issn 0890-5401Article

Compositional synthesis of asynchronous automataBAUDRU, Nicolas.Theoretical computer science. 2011, Vol 412, Num 29, pp 3701-3716, issn 0304-3975, 16 p.Article

Efficient recognition of trace languages defined by repeat-until loopsBREVEGLIERI, Luca; CRESPI REGHIZZI, Stefano; GOLDWURM, Massimiliano et al.Information and computation (Print). 2010, Vol 208, Num 8, pp 969-981, issn 0890-5401, 13 p.Article